Adjunct elimination in Context Logic for trees
نویسندگان
چکیده
منابع مشابه
Adjunct Elimination in Context Logic for Trees
We study adjunct-elimination results for Context Logic applied to trees, following previous results by Lozes for Separation Logic and Ambient Logic. In fact, it is not possible to prove such elimination results for the original single-holed formulation of Context Logic. Instead, we prove our results for multi-holed Context Logic.
متن کاملAdjunct Elimination Through Games in Static Ambient Logic
Spatial logics are used to reason locally about disjoint data structures. They consist of standard first-order logic constructs, spatial (structural) connectives and their corresponding adjuncts. Lozes has shown that the adjuncts add no expressive power to a spatial logic for analysing tree structures, a surprising and important result. He also showed that a related logic does not have this adj...
متن کاملEfficient Caching in Elimination Trees
In this paper, we present subcaching, a method for reducing the size of the caches in the recursive decomposition while maintaining the runtime of recursive conditioning with complete caching. We also demonstrate a heuristic for constructing recursive decompositions that improves the effects of subcaching, and show empirically that the savings in space is quite substantial, with very little eff...
متن کاملSoftware for Quantifier Elimination in Propositional Logic
We consider the problem of Quantifier Elimination (QE): given a Boolean CNF formula F where some variables are existentially quantified, find a logically equivalent quantifier-free CNF formula. This problem can be solved by finding a set of clauses containing only free variables such that adding this set of clauses to F makes all of the clauses of F containing quantified variables redundant. To...
متن کاملA Counting Logic for Trees
It has been recently shown that the fully enriched μ-calculus, an expressive modal logic, is undecidable. In the current work, we prove that this result does not longer hold when considering finite tree models. This is achieved with the introduction of an extension of the fully enriched μ-calculus for trees with numerical constraints. Contrastively with graded modalities, which restrict the occ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2010
ISSN: 0890-5401
DOI: 10.1016/j.ic.2009.02.013